Boundaries, Vermas and factorisation

نویسندگان

چکیده

We revisit the factorisation of supersymmetric partition functions 3d $\mathcal{N}=4$ gauge theories. The building blocks are hemisphere a class UV $\mathcal{N}=(2,2)$ boundary conditions that mimic presence isolated vacua at infinity in real mass and FI parameters. These can be unambiguously defined computed using localisation. show certain limits these coincide with characters lowest weight Verma modules over quantised Higgs Coulomb branch chiral rings. This leads to expressions for superconformal index, twisted index $S^3$ function terms such characters. On way we uncover new connections between 't Hooft anomalies, weights modules.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Bayesian Non-Negative Matrix Factorisation and Tri-Factorisation

Nonnegative matrix factorisation and tri-factorisation Nonnegative matrix factorisation (NMF) and tri-factorisation (NMTF) methods decompose a given matrix R into two or three smaller matrices so that R ≈ UV T or R ≈ FSG , respectively. Schmidt, Winther and Hansen (2009) introduced a Bayesian version of nonnegative matrix factorisation (left), which we extend to matrix tri-factorisation (right)...

متن کامل

Acoustic Factorisation

This paper describes a new technique for training a speech recognition system on inhomogenous training data. The proposed technique , acoustic factorisation, attempts to explicitly model all the factors that affect the acoustic signal. By explicitly modelling all the factors the trained model set may be used in a more flexible fashion than in standard adaptive training schemes. Since an individ...

متن کامل

Mimd{factorisation on Hypercubes Mimd-factorisation on Hypercubes

This paper describes the development and implementation of the MPQS factoring algorithm using multiple hypercubes customised to a MIMD parallel computer. The computationally most expensive steps ran on a Parsytec machine consisting of 1024 Inmos T805 microprocessors. General 100 decimal digit numbers can be factored in 1{2 days.

متن کامل

The factorisation Forest Theorem

This chapter is devoted to the presentation of the factorisation forest theorem, a deep result due to Simon, which provides advanced Ramsey-like arguments in the context of algebra, automata, and logic. We present several proofs and several variants the result, as well as applications.

متن کامل

Purity through Factorisation

We give a construction that identifies the collection of pure processes (i.e. those which are deterministic, or without randomness) within a theory containing both pure and mixed processes. Working in the framework of symmetric monoidal categories, we define a pure subcategory. This definition arises elegantly from the categorical notion of a weak factorisation system. Our construction gives th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2021

ISSN: ['1127-2236', '1126-6708', '1029-8479']

DOI: https://doi.org/10.1007/jhep04(2021)263